Subspace Tracking for Latent Semantic Analysis
Identifieur interne : 000434 ( Main/Exploration ); précédent : 000433; suivant : 000435Subspace Tracking for Latent Semantic Analysis
Auteurs : Radim Ehů Ek [République tchèque]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2011.
Abstract
Abstract: Modern applications of Latent Semantic Analysis (LSA) must deal with enormous (often practically infinite) data collections, calling for a single-pass matrix decomposition algorithm that operates in constant memory w.r.t. the collection size. This paper introduces a streamed distributed algorithm for incremental SVD updates. Apart from the theoretical derivation, we present experiments measuring numerical accuracy and runtime performance of the algorithm over several data collections, one of which is the whole of the English Wikipedia.
Url:
DOI: 10.1007/978-3-642-20161-5_29
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001891
- to stream Istex, to step Curation: 001792
- to stream Istex, to step Checkpoint: 000090
- to stream Main, to step Merge: 000439
- to stream Main, to step Curation: 000434
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Subspace Tracking for Latent Semantic Analysis</title><author><name sortKey=" Ehu Ek, Radim" sort=" Ehu Ek, Radim" uniqKey=" Ehu Ek R" first="Radim" last=" Ehů Ek">Radim Ehů Ek</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:D07761AA2C4C085D21589F4201F6F31BE364C39D</idno><date when="2011" year="2011">2011</date><idno type="doi">10.1007/978-3-642-20161-5_29</idno><idno type="url">https://api.istex.fr/document/D07761AA2C4C085D21589F4201F6F31BE364C39D/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001891</idno><idno type="wicri:Area/Istex/Curation">001792</idno><idno type="wicri:Area/Istex/Checkpoint">000090</idno><idno type="wicri:doubleKey">0302-9743:2011: Ehu Ek R:subspace:tracking:for</idno><idno type="wicri:Area/Main/Merge">000439</idno><idno type="wicri:Area/Main/Curation">000434</idno><idno type="wicri:Area/Main/Exploration">000434</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Subspace Tracking for Latent Semantic Analysis</title><author><name sortKey=" Ehu Ek, Radim" sort=" Ehu Ek, Radim" uniqKey=" Ehu Ek R" first="Radim" last=" Ehů Ek">Radim Ehů Ek</name><affiliation><wicri:noCountry code="subField">Republic</wicri:noCountry></affiliation><affiliation wicri:level="1"><country wicri:rule="url">République tchèque</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2011</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">D07761AA2C4C085D21589F4201F6F31BE364C39D</idno><idno type="DOI">10.1007/978-3-642-20161-5_29</idno><idno type="ChapterID">29</idno><idno type="ChapterID">Chap29</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Modern applications of Latent Semantic Analysis (LSA) must deal with enormous (often practically infinite) data collections, calling for a single-pass matrix decomposition algorithm that operates in constant memory w.r.t. the collection size. This paper introduces a streamed distributed algorithm for incremental SVD updates. Apart from the theoretical derivation, we present experiments measuring numerical accuracy and runtime performance of the algorithm over several data collections, one of which is the whole of the English Wikipedia.</div></front></TEI><affiliations><list><country><li>République tchèque</li></country></list><tree><country name="République tchèque"><noRegion><name sortKey=" Ehu Ek, Radim" sort=" Ehu Ek, Radim" uniqKey=" Ehu Ek R" first="Radim" last=" Ehů Ek">Radim Ehů Ek</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000434 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000434 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:D07761AA2C4C085D21589F4201F6F31BE364C39D
|texte= Subspace Tracking for Latent Semantic Analysis
}}
| This area was generated with Dilib version V0.6.32. |  |